Plurals: individuals and sets in a richly typed semantics
نویسندگان
چکیده
We developed a type-theoretical framework for natural language semantics that, in addition to the usual Montagovian treatment of compositional semantics, includes a treatment of some phenomena of lexical semantic: coercions, meaning, transfers, (in)felicitous co-predication. In this setting we see how the various readings of plurals (collective, distributive, coverings,. . . ) can be modelled.
منابع مشابه
Plurals Yoad Winter and Remko Scha April 2014
In English and many other languages, noun phrases are subcategorized for number: they are either singular or plural. Though strictly speaking a morpho-syntactic phenomenon, this subcategorization has important semantic correlates. Whereas singular noun phrases typically refer to atomic individuals or to quantifiers over such individuals, plural noun phrases typically involve reference to (or qu...
متن کاملProperties, Plurals and Paradox
It has been argued that an objectual semantics for plurals falls victim to Russell's paradox, and that a nominalistic semantics should therefore be preferred (Boolos 1984); similar considerations have sometimes been extended to other types of abstract reference, in particular to property talk. We suggest that this line of argument is mistaken: deeply entrenched features of ordinary language gua...
متن کاملOn the Meaning of Shenme 'what' in Chinese Bare Conditionals and its Implications for Carlson's Semantics of Bare Plurals
This paper shows that the semantics of shenme 'what' exhibits a double quantification phenomenon in Chinese bare conditionals. I show that such double quantification can be nicely accounted for if one adopts Carlosn's semantics of bare plurals and verb meanings as well as the assumption that shenme 'what' may denote kinds of things as bare plurals do.
متن کاملSemantics of Higher-Order Logic (ESSLLI 2006 Course Notes)
Definition 2 A typed family of sets D is a collection of sets Dα indexed by types α ∈ T . A typed family of nonempty sets D is a typed family of sets such that Dα is nonempty for each α ∈ T . Given two typed families of sets D and D, a typed function f : D → D is a collection of functions fα : Dα → D α indexed by types α ∈ T . We use FT (D,D ) to denote the set of typed functions from a typed f...
متن کاملTyped Hilbert Epsilon Operators and the Semantics of Determiner Phrases
The semantics of determiner phrases, be they definite descriptions, indefinite descriptions or quantified noun phrases, is often assumed to be a fully solved question: common nouns are properties, and determiners are generalised quantifiers that apply to two predicates: the property corresponding to the common noun and the one corresponding to the verb phrase. We first present a criticism of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1401.0660 شماره
صفحات -
تاریخ انتشار 2014